A complete L(2,1) span characterization for small trees
نویسندگان
چکیده
منابع مشابه
Molecular cloning and characterization of porcine ribosomal protein L21
Ribosomal protein L21 (RPL21) is a structural component of the 60S subunit of the eukaryotic ribosome. This protein has an important role in protein synthesis and the occurrence of hereditary diseases. Pig is a common laboratory model, however, to the best of our knowledge, its RPL21 gene has not been cloned to date. In this study, we cloned and identified the full-length sequence of the pig RP...
متن کاملA Small Span Theorem within P
The development of Small Span Theorems for various complexity classes and re ducibilities plays a basic role in resource bounded measure theoretic investigations of e cient reductions A Small Span Theorem for a complexity class C and reducibil ity r is the assertion that for all sets A in C at least one of the cones below or above A is a negligible small class with respect to C where the cones ...
متن کاملIsolation and characterization of a fungus for extracellular synthesis of small selenium nanoparticles
The use of biogenic selenium nanoparticles for various purposes is going to be an issue of considerable importance; thus, appropriate simple methods should be developed and tested for the synthesis and recovery of these nanoparticles. In this study, a fungus was isolated from a soil sample, identified as Aspergillus terreus and used for extracellular synthesis of selenium nanoparticles (Se NPs)...
متن کاملDistance and Similarity of Time-span Trees
Time-span tree in Lerdahl and Jackendoff’s theory [12] has been regarded as one of the most dependable representations of musical structure. We first show how to formalize the time-span tree in feature structure, introducing head and span features. Then, we introduce join and meet operations among them. The span feature represents the temporal length during which the head pitch event is most sa...
متن کاملA Small Span Theorem for P/Poly-Turing Reductions
This paper investigates the structure of ESPACE under nonuniformTuring reductions that are computed by polynomial size circuits P Poly Turing reductions A Small Span Theorem is proven for such reductions This result says that every language A in ESPACE satis es at least one of the following two conditions i The lower P Poly Turing span of A consisting of all languages that are P Poly Turing red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKCE International Journal of Graphs and Combinatorics
سال: 2015
ISSN: 0972-8600,2543-3474
DOI: 10.1016/j.akcej.2015.06.004